Preprocessing of the Axiomatic System for More Efficient Automated Proving and Shorter Proofs

One of the main differences between pen-and-paper proofs and computer proofs is in the number of simple facts derived. In automated proof generation, the number of simple facts can be large. We are addressing this problem by preprocessing of the axiomatic system that should enable reduction in the number of simple and redundant facts to some extent. We implemented two types of preprocessing techniques, one concerning symmetric predicates, and another restricting introduction of witnesses during proof search. Both techniques were used within a coherent logic prover ArgoCLP. Evaluations performed on geometrical domain show that use of these techniques makes automated process more efficient and generated proofs often significantly shorter.